Two Approaches to Simulated Annealing for Uncapacitated Facility Location Problems

نویسندگان

  • Emin Aydin
  • C. Fogarty
چکیده

The aim of this paper is to examine two new simulated annealing approaches for Uncapacitated Facility Location (UFL) problems with some useful comparisons with the latest genetic algorithm approach (Jaramillo et al, 2002) to the problem. As it is mentioned in various publications, the simulated annealing approach may be very successful in terms of quality of the solution but not so impressive with respect to the CPU times. The approaches presented in this paper are seeking for utilising that power of the method in getting quality of solutions within shorter time. For this purpose, simulated annealing algorithms incorporated in evolutionary and parallelisation approaches in order to cut down the time needed. Key words; facility planning and design, simulated annealing, multi-agent systems 1 Corresponding author Address: South Bank University, School of Computing, Information Systems and Maths, 103 Borough Road, London, SE1 0AA, UK Tel: +44 (20) 7815 7414 Fax: +44 (20) 7815 7499 e-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems

In this paper, the Evolutionary Simulated Annealing (ESA) algorithm, its distributed implementation (dESA) and its application to two combinatorial problems are presented. ESA consists of a population, a simulated annealing operator, instead of the more usual reproduction operators used in evolutionary algorithms, and a selection operator. The implementation is based on a multi island (agent) s...

متن کامل

Cuckoo search via Levy flights applied to uncapacitated facility location problem

Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...

متن کامل

A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

متن کامل

A mathematical model for sustainable probabilistic network design problem with construction scheduling considering social and environmental issues

Recent facility location allocation problems are engaged with social, environmental and many other aspects, besides cost objectives.Obtaining a sustainable solution for such problems requires development of new mathematical modeling and optimization algorithms. In this paper, an uncapacitated dynamic facility location-network design problem with random budget constraints is considered. Social i...

متن کامل

Metaheuristic Approaches to Solving Large-scale Bilevel Uncapacitated Facility Location Problem with Clients’ Preferences

In this study, we consider a variant of the Bilevel Uncapacitated Facility Location Problem (BLUFLP), in which the clients choose suppliers based on their own preferences. We propose and compare three metaheuristic approaches for solving this problem: Particle Swarm Optimization (PSO), Simulated Annealing (SA), and a combination of Reduced and Basic Variable Neighborhood Search Method (VNS). We...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002